Timing In uenced Force Directed Floorplanning
نویسندگان
چکیده
We present a timing driven oorplanning program for general cell layouts. The approach used combines quality of force directed approach with that of constraint graph approach. A oorplan solution is produced in two steps. First a timing and connectivity driven topological arrangement is obtained using a force directed approach. In the second step, the topological arrangement is transformed into a legal oorplan. The objective of the second step is to minimize the overall area of the oorplan. The oorplanner is validated with circuits of sizes varying from 7 to 125 blocks.
منابع مشابه
Graph Drawing for Floorplanning with Flexible Blocks
We discuss further development of a modified force-directed graph drawing placement algorithm for reducing wire length while placing flexible blocks during the floorplanning stage of computer chip design. An effective repelling perimeter allows floorplanning blocks and to pass through each other during early stages of a run in response to spring tensions on the edges, yet repel just enough to a...
متن کاملNet-based force-directed macrocell placement for wirelength optimization
We propose a net-based hierarchical macrocell placement such that “net placement” dictates the cell placement. The proposed approach has four phases. 1) Net clustering and net-level floorplanning phase: A weighted net dependency graph is built from the input register-transfer-level netlist. Clusters of nets are then formed by clique partitioning and a net-cluster level floorplan is obtained by ...
متن کاملTrapezoidal Algorithm with Weighted Aggregation Scheme for floor planning in VLSI
An important step in the automation of electronic design is the assignment of the physical components on the target semiconductor die. The major aim of floorplanning is to distribute the modules of a circuit onto a chip to optimize its area, wire length and timing. As the density of very large scale integrated (VLSI) circuits enhance, the need for faster floorplanning algorithms also grows. The...
متن کاملTrapezoidal Algorithm with Weighted Aggregation Scheme for floorplanning in VLSI
An important step in the automation of electronic design is the assignment of the physical components on the target semiconductor die. The major aim of floorplanning is to distribute the modules of a circuit onto a chip to optimize its area, wire length and timing. As the density of very large scale integrated (VLSI) circuits enhance, the need for faster floorplanning algorithms also grows. The...
متن کاملSimultaneous Delay and Power Optimization for Multi-level Partitioning and Floorplanning with Retiming
Delay minimization and power minimization are two important objectives in the design of the high-performance, portable, and wireless computing and communication systems. Retiming is a very effective way for delay optimization for sequential circuits. In this paper we propose a unified framework for multi-level partitioning and floorplanning with retiming, targeting simultaneous delay and power ...
متن کامل